A Construction of 100 bit Public-Key Cryptosystem and Digital Signature Scheme
نویسندگان
چکیده
منابع مشابه
A Cryptographic Study of Some Digital Signature Schemes
RSA Cryptosystem ElGamal Cryptosystem Messey Omura Cryptosystem Knapsack Cryptosystem Construction of Knapsack Cryptosystem Quadratic Residue Cryptosystem Hybrid Cryptosystem: Diffie Hellman’s key Exchange Digital Signatures A Classification of Digital Signature Schemes Digital Signature Schemes with Appendix Digital Signature Schemes with Message Recovery RSA Signature Scheme Feige– Fiat – Sha...
متن کاملSecure and Fast Digital Signatures using BCH Codes
Since the introduction of public key cryptography in the 70’s [1], many cryptosystems have been proposed and many cryptographic schemes have been broken. The most used cryptosystems rely on number theory problem like the factorization problem [3] and the discrete logarithm over suitable group [2]. The McEliece cryptosystem [5] and the Neiderreiter variante [6] rely on coding theory, they are on...
متن کاملDesign of DL-based certificateless digital signatures
Public-key cryptosystems without requiring digital certificates are very attractive in wireless communications due to limitations imposed by communication bandwidth and computational resource of the mobile wireless communication devices. To eliminate public-key digital certificate, Shamir introduced the concept of the identity-based (ID-based) cryptosystem. The main advantage of the ID-based cr...
متن کاملNSS: The NTRU Signature Scheme
A new authentication and digital signature scheme called the NTRU Signature Scheme (NSS) is introduced. NSS provides an authentication/signature method complementary to the NTRU public key cryptosystem. The hard lattice problem underlying NSS is similar to the hard problem underlying NTRU, and NSS similarly features high speed, low footprint, and easy key creation.
متن کاملA Public-Key Cryptosystem Scheme on Conic Curves over the Ring Zn
A public key cryptosystem scheme is proposed that are based on conic curves over the ring Zn. Our scheme is motivated by KMOV scheme on elliptic curves, but our scheme remove some restrictive condition from KMOV scheme and constructed on conic curves. Its security bases on the difficulty of factoring a composite number n, just like RSA. It can resist some of the known attacks on RSA. We also co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2003 شماره
صفحات -
تاریخ انتشار 2003